Multidimensional Scaling on Multiple Input Distance Matrices
نویسندگان
چکیده
Multidimensional Scaling (MDS) is a classic technique that seeks vectorial representations for data points, given the pairwise distances between them. However, in recent years, data are usually collected from diverse sources or have multiple heterogeneous representations. How to do multidimensional scaling on multiple input distance matrices is still unsolved to our best knowledge. In this paper, we first define this new task formally. Then, we propose a new algorithm called Multi-View Multidimensional Scaling (MVMDS) by considering each input distance matrix as one view. Our algorithm is able to learn the weights of views (i.e., distance matrices) automatically by exploring the consensus information and complementary nature of views. Experimental results on synthetic as well as real datasets demonstrate the effectiveness of MVMDS. We hope that our work encourages a wider consideration in many domains where MDS is needed.
منابع مشابه
Dimensionality Reduction via Euclidean Distance Embeddings
This report provides a mathematically thorough review and investigation of Metric Multidimensional scaling (MDS) through the analysis of Euclidean distances in input and output spaces. By combining a geometric approach with modern linear algebra and multivariate analysis, Metric MDS is viewed as a Euclidean distance embedding transformation that converts between coordinate and coordinate-free r...
متن کاملDISTATIS How to analyze multiple distance matrices
DISTATIS is a generalization of classical multidimensional scaling (MDS see the corresponding entry formore details on thismethod) proposed by Abdi et al., (2005). Its goal is to analyze several distance matrices computed on the same set of objects. The name DISTATIS is derived from a technique called STATIS whose goal is to analyze multiple data sets (see the corresponding entry for more detai...
متن کاملDistance-Based Partial Least Squares Analysis
Distances matrices are traditionally analyzed with statistical methods that represent distances as maps such as Metric Multidimensional Scaling (MDS), Generalized Procrustes Analysis (GPA), Individual Differences Scaling (INDSCAL), and DISTATIS. MDS analyzes only one distance matrix at a time while GPA, INDSCAL and DISTATIS extract similarities between several distance matrices. However, none o...
متن کاملOn Certain Linear Mappings Between Inner-Product and Squared-Distance Matrices
We obtain the spectral decomposition of four linear mappings. The first, Ie, is a mapping of the linear hull of all centered inner-product matrices onto the linear hull of all the induced squared-distance matrices. It is based on the natural generalization of the cosine law of elementary Euclidean geometry. The other three mappings studied are ,,1, the adjoint ,,*, and (" *)1. Extensions and ap...
متن کاملSparse and low-rank approximations of large symmetric matrices using biharmonic interpolation
Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the distance matrix, which fits in memory and can be efficiently analyzed using met...
متن کامل